Reductions between short vector problems and simultaneous approximation
نویسندگان
چکیده
منابع مشابه
A Short Guide to Approximation Preserving Reductions
Comparing the complexity of different combinatorial optimization problems has been an extremely active research area during the last 23 years. This has led to the definition of several approximation preserving reducibilities and to the development of powelful reduction techniques. We first review the main approximation preserving reducibilities that have appeared in the literature and suggest w...
متن کاملSimultaneous approximation for scheduling problems
Motivated by the problem to approximate all feasible schedules by one schedule in a given scheduling environment, we introduce in this paper the concepts of strong simultaneous approximation ratio (SAR) and weak simultaneous approximation ratio (WAR). Then we study the two parameters under various scheduling environments, such as, nonpreemptive, preemptive or fractional scheduling on identical,...
متن کاملOn Approximation Preserving Reductions : Complete Problems and Robust Measures
We investigate the well-known anomalous diierences in the approximability properties of NP-complete optimization problems. We deene a notion of polynomial time reduction between optimization problems, and introduce conditions guaranteeing that such reductions preserve various types of approximate solutions. We then prove that a weighted version of the satissability problem, the traveling salesp...
متن کاملSimultaneous Approximation of Constraint Satisfaction Problems
Given k collections of 2SAT clauses on the same set of variables V , can we find one assignment that satisfies a large fraction of clauses from each collection? We consider such simultaneous constraint satisfaction problems, and design the first nontrivial approximation algorithms in this context. Our main result is that for every CSP F , for k ă Õplog1 nq, there is a polynomial time constant f...
متن کاملDistributed computing of simultaneous Diophantine approximation problems
In this paper we present the Multithreaded Advanced Fast Rational Approximation algorithm – MAFRA – for solving n-dimensional simultaneous Diophantine approximation problems. We show that in some particular applications the Lenstra-Lenstra-Lovász (L) algorithm can be substituted by the presented one in order to reduce their practical running time. MAFRA was implemented in the following architec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Book Series
سال: 2020
ISSN: 2329-907X,2329-9061
DOI: 10.2140/obs.2020.4.335